The Hamiltonian Strictly Alternating Cycle Problem
نویسنده
چکیده
In this paper we consider an approach to solve the Hamiltonian strictly alternating cycle problem. This approach is based on constructing logical models for the problem.
منابع مشابه
On Hamiltonian alternating cycles and paths
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case...
متن کاملFault-free Hamiltonian Cycles in Alternating Group Graphs with Conditional Edge Faults
The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...
متن کاملLong Alternating Cycles in Edge-Colored Complete Graphs
Let K n denote a complete graph on n vertices whose edges are colored in an arbitrary way. And let ∆(K n) denote the maximum number of edges of the same color incident with a vertex of K n. A properly colored cycle (path) in K n, that is, a cycle (path) in which adjacent edges have distinct colors is called an alternating cycle (path). Our note is inspired by the following conjecture by B. boll...
متن کاملOn the Hamiltonicity Gap and doubly stochastic matrices
We consider the Hamiltonian cycle problem embedded in singularly perturbed (controlled) Markov chains. We also consider a functional on the space of stationary policies of the process that consists of the (1,1)-entry of the fundamental matrices of the Markov chains induced by these policies. We focus on the subset of these policies that induce doubly stochastic probability transition matrices w...
متن کاملAlternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M be a 2-edge-coloured complete multigraph. M. Bankfalvi and Zs. Bankfalvi [2] obtained a necessary and sufficient condition for G to have a Hamiltonian alternating cycle. Generalizing this theorem, P. Das and S.B. Rao [7]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012